منابع مشابه
Stable Minimum Space Partitioning in Linear Time
In the stable 0-1 sorting problem the task is to sort an array of n elements with two distinct values such that equal elements retain their relative input order. Recently, Munro, Raman and Salowe [BIT 1990] gave an algorithm which solves this problem in O(nlog*n)3 time and constant extra space. We show that by a modification of their method the stable 0-1 sorting is possible in O(n) time and O(...
متن کاملReal-Time String Matching in Sublinear Space
We study a problem of efficient utilisation of extra memory space in real-time string matching. We propose, for any constant " > 0, a real-time string matching algorithm claiming O(m") extra space, where m is the size of a pattern. All previously known real-time string matching algorithms use (m) extra
متن کاملSublinear Time and Space Algorithms 2016B – Lecture 7 Sublinear-Time Algorithms for Sparse Graphs∗
Problem definition: Input: A graph represented (say) as the adjacency list for each vertex (or even just the degree of each vertex) Goal: Compute the average degree (equiv. number of edges) Concern: Seems to be impossible e.g. if all degrees ≤ 1, except possibly for a few vertices whose degree is about n. Theorem 1 [Feige, 2004]: There is an algorithm that estimates the average degree d of a co...
متن کاملDelay-Dependent Robust Asymptotically Stable for Linear Time Variant Systems
In this paper, the problem of delay dependent robust asymptotically stable for uncertain linear time-variant system with multiple delays is investigated. A new delay-dependent stability sufficient condition is given by using the Lyapunov method, linear matrix inequality (LMI), parameterized first-order model transformation technique and transformation of the interval uncertainty in to the norm ...
متن کاملLower bounds and complete problems in nondeterministic linear time and sublinear space complexity classes
Proving lower bounds remains the most difficult of tasks in computational complexity theory. In this paper, we show that whereas most natural NP-complete problems belong to NLIN (linear time on nondeterministic RAMs), some of them, typically the planar versions of many NP-complete problems are recognized by nondeterministic RAMs in linear time and sublinear space. The main results of this paper...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1987
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/30.4.372